Evolving spring-mass models: a test-bed for graph encoding schemes
نویسنده
چکیده
For many interesting design problems the solution is most naturally represented as a type of graph. This paper proposes that the problem of evolving spring-mass models for a set of design challenges makes an excellent test-bed for evaluating the performance of various graph encoding schemes. We describe how the problem is set up, and introduce a planar graph coding scheme. Results demonstrate that the planar graph encoding scheme significantly outperforms a simple direct encoding scheme on a heightchallenge design problem.
منابع مشابه
Potentials of Evolving Linear Models in Tracking Control Design for Nonlinear Variable Structure Systems
Evolving models have found applications in many real world systems. In this paper, potentials of the Evolving Linear Models (ELMs) in tracking control design for nonlinear variable structure systems are introduced. At first, an ELM is introduced as a dynamic single input, single output (SISO) linear model whose parameters as well as dynamic orders of input and output signals can change through ...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملEvolving Deterministic Finite Automata Using Cellular Encoding
This paper presents a method for the evolution of deterministic finite automata that combines genetic programming and cellular encoding. Programs are evolved that specify actions for the incremental growth of a deterministic finite automata from an initial single-state zygote. The results show that, given a test bed of positive and negative samples, the proposed method is successful at inducing...
متن کاملVega: Non-Linear FEM Deformable Object Simulator
This practice and experience paper describes a robust C++ implementation of several nonlinear solid 3D deformable object strategies commonly employed in computer graphics, named the Vega FEM simulation library. Deformable models supported include co-rotational linear FEM elasticity, Saint-Venant Kirchhoff FEM model, mass-spring system, and invertible FEM models: neo-Hookean, Saint-Venant Kirchh...
متن کامل